Engineering Drawing Retrieval Based On Nested Assignment Algorithm

On visual similarity based 2D drawing retrieval

A large amount of 2D drawings have been produced in engineering fields. To reuse and share the available drawings efficiently, we propose two methods in this paper, namely 2.5D spherical harmonics transformation and 2D shape histogram, to retrieve 2D drawings by measuring their shape similarity. The first approach represents a drawing as a spherical function by transforming it from a 2D space i...

Graph Drawing with Algorithm Engineering Methods

This report documents the program and the outcomes of Dagstuhl Seminar 11191 “Graph Drawing with Algorithm Engineering Methods”. We summarize the talks, open problems, and working group discussions. Seminar 8.–13. May, 2011 – www.dagstuhl.de/11191 1998 ACM Subject Classification E.1 Data structures, F.2 Analysis of algorithms and problem complexity, G.1.6 Optimization, G.2.1 Combinatorics, G.2....

Engineering Drawing Based Database Rendering

A Path-Based Algorithm for the Cross-Nested Logit Stochastic User Equilibrium Traffic Assignment

This paper investigates the single-class static stochastic user equilibrium (SUE) problem with separable and additive link costs. A SUE assignment based on the Cross-Nested Logit (CNL) route choice model is presented. The CNL model can better represent route choice behavior compared to the Multinomial Logit (MNL) model, while keeping a closed form equation. The paper uses a specific optimizatio...

A New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity

Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...